From local to global deformation quantization of Poisson manifolds

We give an explicit construction of a deformation quantization of the algebra of functions on a Poisson manifolds, based on Kontsevich's local formula. The deformed algebra of functions is realized as the algebra of horizontal sections of a vector bundle with flat connection.Comment: 16 pages. Reference and dedication added. Sign corrected, remark on Poisson vector fields adde

Fedosov connections on jet bundles and deformation quantization

We review our construction of star-products on Poisson manifolds and discuss some examples. In particular, we work out the relation with Fedosov's original construction in the symplectic case.Comment: Contribution to the proceedings of the conference "Deformation Quantization", Strasbourg, May 31-June 2, 200

Genetic sensitivity to the bitter taste of 6-n-propylthiouracil (PROP) and its association with Physiological mechanisms controlling Body Mass Index (BMI)

Taste sensitivity to the bitter compound 6-n-propylthiouracil (PROP) is considered a marker for individual differences in taste perception that may influence food preferences and eating behavior, and thereby energy metabolism. This review describes genetic factors that may contribute to PROP sensitivity including: (1) the variants of the TAS2R38 bitter receptor with their different affinities for the stimulus; (2) the gene that controls the gustin protein that acts as a salivary trophic factor for fungiform taste papillae; and (3) other specific salivary proteins that could be involved in facilitating the binding of the PROP molecule with its receptor. In addition, we speculate on the influence of taste sensitivity on energy metabolism, possibly via modulation of the endocannabinoid system, and its possible role in regulating body composition homeostasis

Energy bounds for vertex operator algebra extensions

Let V be a simple unitary vertex operator algebra and U be a (polynomially) energy-bounded unitary subalgebra containing the conformal vector of V. We give two sufficient conditions implying that V is energy-bounded. The first condition is that U is a compact orbifold for some compact group G of unitary automorphisms of V. The second condition is that V is exponentially energy-bounded and it is a finite direct sum of simple U-modules. As consequence of the second condition, we prove that if U is a regular energy-bounded unitary subalgebra of a simple unitary vertex operator V, then V is energy-bounded. In particular, every simple unitary extension (with the same conformal vector) of a simple unitary affine vertex operator algebra associated with a semisimple Lie algebra is energy-bounded

Negative ion Time Projection Chamber operation with SF6_{6} at nearly atmospheric pressure

We present measurements of drift velocities and mobilities of some innovative negative ion gas mixtures at nearly atmospheric pressure based on SF$_{6}$ as electronegative capture agent and of pure SF$_{6}$ at various pressures, performed with the NITEC detector. NITEC is a Time Projection Chamber with 5 cm drift distance readout by a GEMPix, a triple thin GEMs coupled to a Quad-Timepix chip, directly sensitive to the deposited charge on each of the 55 $\times$ 55 $\mu$m$^2$ pixel. Our results contribute to expanding the knowledge on the innovative use of SF$_{6}$ as negative ion gas and extend to triple thin GEMs the possibility of negative ion operation for the first time. Above all, our findings show the feasibility of negative ion operation with He:CF$_4$:SF$_{6}$ at 610 Torr, opening extremely interesting possibility for next generation directional Dark Matter detectors at 1 bar

Complex-network analysis of combinatorial spaces: The NK landscape case

We propose a network characterization of combinatorial fitness landscapes by adapting the notion of inherent networks proposed for energy surfaces. We use the well-known family of NK landscapes as an example. In our case the inherent network is the graph whose vertices represent the local maxima in the landscape, and the edges account for the transition probabilities between their corresponding basins of attraction. We exhaustively extracted such networks on representative NK landscape instances, and performed a statistical characterization of their properties. We found that most of these network properties are related to the search difficulty on the underlying NK landscapes with varying values of K.Comment: arXiv admin note: substantial text overlap with arXiv:0810.3492, arXiv:0810.348

A transformation sequencing approach to pseudorandom number generation

This paper presents a new approach to designing pseudorandom number generators based on cellular automata. Current cellular automata designs either focus on i) ensuring desirable sequence properties such as maximum length period, balanced distribution of bits and uniform distribution of n-bit tuples etc. or ii) ensuring the generated sequences pass stringent randomness tests. In this work, important design patterns are first identified from the latter approach and then incorporated into cellular automata such that the desirable sequence properties are preserved like in the former approach. Preliminary experiment results show that the new cellular automata designed have potential in passing all DIEHARD tests

Evolution of Cooperation and Coordination in a Dynamically Networked Society

Situations of conflict giving rise to social dilemmas are widespread in society and game theory is one major way in which they can be investigated. Starting from the observation that individuals in society interact through networks of acquaintances, we model the co-evolution of the agents' strategies and of the social network itself using two prototypical games, the Prisoner's Dilemma and the Stag Hunt. Allowing agents to dismiss ties and establish new ones, we find that cooperation and coordination can be achieved through the self-organization of the social network, a result that is non-trivial, especially in the Prisoner's Dilemma case. The evolution and stability of cooperation implies the condensation of agents exploiting particular game strategies into strong and stable clusters which are more densely connected, even in the more difficult case of the Prisoner's Dilemma.Comment: 18 pages, 14 figures. to appea

Optimization of 2-d lattice cellular automata for pseudorandom number generation

This paper proposes a generalized approach to 2-d CA PRNGs – the 2-d lattice CA PRNG – by introducing vertical connections to arrays of 1-d CA. The structure of a 2-d lattice CA PRNG lies in between that of 1-d CA and 2-d CA grid PRNGs. With the generalized approach, 2-d lattice CA PRNG offers more 2-d CA PRNG variations. It is found that they can do better than the conventional 2-d CA grid PRNGs. In this paper, the structure and properties of 2-d lattice CA are explored by varying the number and location of vertical connections, and by searching for different 2-d array settings that can give good randomness based on Diehard test. To get the most out of 2-d lattice CA PRNGs, genetic algorithm is employed in searching for good neighborhood characteristics. By adopting an evolutionary approach, the randomness quality of 2-d lattice CA PRNGs is optimized. In this paper, a new metric, #rn is introduced as a way of finding a 2-d lattice CA PRNG with the least number of cells required to pass Diehard test. Following the introduction of the new metric #rn, a cropping technique is presented to further boost the CA PRNG performance. The cost and efficiency of 2-d lattice CA PRNG is compared with past works on CA PRNGs